Discounted tree solutions
نویسندگان
چکیده
منابع مشابه
Discounted tree solutions
This article introduces a discount parameter and a weight function in Myerson’s (1977) classical model of cooperative games with restrictions on cooperation. The discount parameter aims to reflect the time preference of the agents while the weight function aims to reflect the importance of each node of a graph. We provide axiomatic characterizations of two types of solution that are inspired by...
متن کاملComputing Solutions in Infinite-Horizon Discounted Adversarial Patrolling Games
Stackelberg games form the core of a number of tools deployed for computing optimal patrolling strategies in adversarial domains, such as the US Federal Air Marshall Service and the US Coast Guard. In traditional Stackelberg security game models the attacker knows only the probability that each target is covered by the defender, but is oblivious to the detailed timing of the coverage schedule. ...
متن کاملCadmium Removal from Aqueous Solutions Using Saxaul Tree Ash
Cadmium can be found in wastewater in high concentrations and can cause dangerous effect on aqueous environment and human health. At present, many methods have been used to heavy metals removal. Among this clean up techniques, adsorption techniques by using low-cost adsorbent are more considerable. In this study, batch adsorption experiments were conducted for removal of cadmium ions from a...
متن کاملDiscounted quotas
This paper extends the concept of a quota contract to account for discounting and for the possibility of infinitely many periods: a discounted quota fixes the number of expected discounted plays on each action. I first present a repeated principal-agent contracting environment in which menus of discounted quota contracts are optimal. I then recursively characterize the dynamics of discounted qu...
متن کاملGaussian Process Bandits for Tree Search: Theory and Application to Planning in Discounted MDPs
We motivate and analyse a new Tree Search algorithm, GPTS, based on recent theoretical advances in the use of Gaussian Processes for Bandit problems. We consider tree paths as arms and we assume the target/reward function is drawn from a GP distribution. The posterior mean and variance, after observing data, are used to define confidence intervals for the function values, and we sequentially pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.11.013